| Definitions | s = t, t  T, x:A  B(x),  x:A. B(x), EState(T), a:A fp B(a), f(a), Id,  , strong-subtype(A;B), P   Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e',  ,  b, constant_function(f;A;B), SWellFounded(R(x;y)),  , pred!(e;e'),   x,y. t(x;y), <a, b>,  A, pred(e), first(e), x. t(x), P & Q, Top, ES, AbsInterface(A), E, {x:A| B(x)} , E(X), let x,y = A in B(x;y), t.1, e c e', (e < e'), P  Q, y is f*(x), e loc e' , (e <loc e'), e(e1,e2].P(e), @e(x v), (last change to x before e), A c B, pred(e),  x:A. B(x), hd(l), y=f*(x) via L, P  Q, P Q, lastchange(x;e), es-init(es;e), True, sender(e), (x l), A List , [car / cdr], [], a < b, {T},  T, False, Void, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , e  X, #$n, l[i], t ...$L,  , Outcome, ||as||, n+m, A B, i  j , loc(e) |